Age Optimal Information Gathering and Dissemination on Graphs

We consider the problem of timely exchange updates between a central station and set ground terminals $V$ , via mobile agent that traverses across along mobility graph notation="LaTeX">$G = (V, E)$ . design trajectory to minimize average-peak average age information (AoI), two recently proposed metrics for measuring timeliness information. randomized trajectories, in which travels from terminal notation="LaTeX">$i$ notation="LaTeX">$j$ with probability notation="LaTeX">$P_{i,j}$ For gathering problem, we show is optimal factor- notation="LaTeX">$8\mathcal {H}$ optimal, where notation="LaTeX">$\mathcal mixing time on notation="LaTeX">$G$ also minimization NP-hard. dissemination prove same notation="LaTeX">$O(\mathcal {H})$ optimal. Moreover, propose an age-based trajectory, utilizes about current at terminals, it factor-2 symmetric setting.